0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n101.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:18:54 CST 2018
0.00/0.20	% done 10 iterations in 0.004s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(binunionIL, axiom,
0.00/0.20	  (binunionIL <=> (![A,B,Xx]: (in(Xx,A) => in(Xx,binunion(A,B)))))).
0.00/0.20	tff('0', plain,
0.00/0.20	    ![X0, X1, X2]: (~ in(X0, X1) | in(X0, binunion(X1, X2)) | ~ binunionIL),
0.00/0.20	    inference('cnf', [status(esa)], [binunionIL])).
0.00/0.20	tff(breln1unionIL, conjecture,
0.00/0.20	  (binunionIL =>
0.00/0.20	   (![A,R]:
0.00/0.20	      (breln1(A,R) =>
0.00/0.20	       (![S]:
0.00/0.20	          (breln1(A,S) =>
0.00/0.20	           (![Xx]:
0.00/0.20	              (in(Xx,A) =>
0.00/0.20	               (![Xy]:
0.00/0.20	                  (in(Xy,A) =>
0.00/0.20	                   (in(kpair(Xx,Xy),R) => in(kpair(Xx,Xy),binunion(R,S))))))))))))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (binunionIL =>
0.00/0.20	     (![A,R]:
0.00/0.20	        (breln1(A,R) =>
0.00/0.20	         (![S]:
0.00/0.20	            (breln1(A,S) =>
0.00/0.20	             (![Xx]:
0.00/0.20	                (in(Xx,A) =>
0.00/0.20	                 (![Xy]:
0.00/0.20	                    (in(Xy,A) =>
0.00/0.20	                     (in(kpair(Xx,Xy),R) => in(kpair(Xx,Xy),binunion(R,S)))))))))))))).
0.00/0.20	tff('1', plain, binunionIL, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain,
0.00/0.20	    ![X0, X1, X2]: (~ in(X0, X1) | in(X0, binunion(X1, X2)) | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.20	tff('3', plain, ![X0, X1, X2]: (in(X0, binunion(X1, X2)) | ~ in(X0, X1)),
0.00/0.20	    inference('simplify', [status(thm)], ['2'])).
0.00/0.20	tff('4', plain, ~ in(kpair(sk_Xx1, sk_Xy), binunion(sk_R, sk_S)),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('5', plain, (~ $true | ~ in(kpair(sk_Xx1, sk_Xy), sk_R)),
0.00/0.20	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.20	tff('6', plain, in(kpair(sk_Xx1, sk_Xy), sk_R),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('7', plain, (~ $true | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['5', '6'])).
0.00/0.20	tff('8', plain, $false, inference('simplify', [status(thm)], ['7'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
